Methods for Nonlinear Constraints in Optimization Calculations
نویسندگان
چکیده
Ten years ago, the broad consensus among researchers in constrained optimization was that sequential quadratic programming (SQP) methods were the methods of choice. While, in the long term, this position may be justiied, the past ten years have exposed a number of diiculties with the SQP approach. Moreover, alternative methods have shown themselves capable of solving large-scale problems. In this paper, we shall outline the defects with SQP methods, and discuss the alternatives. In particular, we shall indicate how our understanding of the subproblems which inevitably arise in constrained optimization calculations has improved. We shall also consider the impact of interior-point methods for inequality constrained problems, described elsewhere in this volume, and argue that these methods likely provide a more useful Newton model for such problems than do traditional SQP methods. Finally, we shall consider trust-region methods for constrained problems, and the impact of automatic diierentiation on algorithm design.
منابع مشابه
RESOLUTION OF NONLINEAR OPTIMIZATION PROBLEMS SUBJECT TO BIPOLAR MAX-MIN FUZZY RELATION EQUATION CONSTRAINTS USING GENETIC ALGORITHM
This paper studies the nonlinear optimization problems subject to bipolar max-min fuzzy relation equation constraints. The feasible solution set of the problems is non-convex, in a general case. Therefore, conventional nonlinear optimization methods cannot be ideal for resolution of such problems. Hence, a Genetic Algorithm (GA) is proposed to find their optimal solution. This algorithm uses th...
متن کاملStudy on multi-objective nonlinear programming in optimization of the rough interval constraints
This paper deals with multi- objective nonlinear programming problem having rough intervals in the constraints. The problem is approached by taking maximum value range and minimum value range inequalities as constraints conditions, reduces it into two classical multi-objective nonlinear programming problems, called lower and upper approximation problems. All of the lower and upper approximatio...
متن کاملOPTIMIZATION FORMULATION FOR NONLINEAR STRUCTURAL ANALYSIS
In this paper, the effect of angle between predictor and corrector surfaces on the structural analysis is investigated. Two objective functions are formulated based on this angle and also the load factor. Optimizing these functions, and using the structural equilibrium path’s geometry, lead to two new constraints for the nonlinear solver. Besides, one more formula is achieved, which was p...
متن کاملHub Covering Location Problem Considering Queuing and Capacity Constraints
In this paper, a hub covering location problem is considered. Hubs, which are the most congested part of a network, are modeled as M/M/C queuing system and located in placeswhere the entrance flows are more than a predetermined value.A fuzzy constraint is considered in order to limit the transportation time between all origin-destination pairs in the network.On modeling, a nonlinear mathematica...
متن کاملAn efficient modified neural network for solving nonlinear programming problems with hybrid constraints
This paper presents the optimization techniques for solving convex programming problems with hybrid constraints. According to the saddle point theorem, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalleinvariance principle, a neural network model is constructed. The equilibrium point of the proposed model is proved to be equivalent to the optima...
متن کامل